翻訳と辞書 |
Rectilinear minimum spanning tree : ウィキペディア英語版 | Rectilinear minimum spanning tree
In graph theory, the rectilinear minimum spanning tree (RMST) of a set of ''n'' points in the plane (or more generally, in ℝ''d'') is a minimum spanning tree of that set, where the weight of the edge between each pair of points is the rectilinear distance between those two points. ==Properties and algorithms==
It is possible to apply usual algorithms for the minimum spanning tree problem to the complete graph with ''n''2 edges, which yields a complexity of O(''n''2) with appropriate data structures such as the Fibonacci heap.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Rectilinear minimum spanning tree」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|